public class HashBuck2<K,V> {
    static class Node<K,V>{
        public K key;
        public V value;

        public Node<K,V> next;

        public Node(K key, V value) {
            this.key = key;
            this.value = value;
        }
    }

    public Node<K,V>[] array =(Node<K,V>[])new Node[10];
    public int usedSize;

    // put 方法的实现
    public void put(K key,V value){
        int hash = key.hashCode();
        int index = hash % array.length;
        Node<K,V> cur = array[index];
        while(cur != null){
            if(cur.key.equals(key)){
                cur.value = value;
                return;
            }
            cur = cur.next;
        }
        // 接下来进行头插
        Node<K,V> node = new Node<>(key, value);
        node.next = array[index];
        array[index] = node;
        usedSize++;
    }

    // 负载因子暂时先不写


    // 接下来写个 get 方法
    public V get(K key){
        int hash = key.hashCode();
        int index = hash % array.length;
        Node<K,V> cur = array[index];
        while(cur != null){
            while(cur != null){
                if(cur.key.equals(key)){
                    return cur.value;
                }
                cur = cur.next;
            }
        }
        return null;
    }
}
